#define _CRT_SECURE_NO_WARNINGS 1
#include "Binarytree.h"
#include "Queue.h"

void test()
{
	/*char a[] = "123###45##6##";
	int i = 0;
	BTNode* root = CreatTree(a, &i);*/

	BTNode* root = CreatTree();
	PrevOrder(root);
	/*InOrder(root);
	PostOrder(root);*/
	printf("\n");

	int size = TreeSize(root);
	printf("TreeSize:%d\n", size);

	int n = LeafSize(root);
	printf("LeafSize:%d\n", n);

	int m = TreeLevelK(root, 4);
	printf("TreeLevelK:%d\n", m);

	BTNode* p = TreeFind(root, 6);
	printf("TreeFind:%p\n", p);

	LevelOrder(root);

	printf("TreeComplete:%d\n", TreeComplete(root));

	TreeDestroy(root);
	root = NULL;
}

int main()
{
	test();
	return 0;
}